Inference of k-Testable Directed Acyclic Graph Languages
نویسندگان
چکیده
In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data.
منابع مشابه
On Biautomata
We initiate the theory and applications of biautomata. A biautomaton can read a word alternately from the left and from the right. We assign to each regular language L its canonical biautomaton. This structure plays, among all biautomata recognizing the language L, the same role as the minimal deterministic automaton has among all deterministic automata recognizing the language L. We expect tha...
متن کاملAn Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کاملOn Variable Elimination in Discrete Bayesian Network Inference
We are interested in proving that variable elimination (VE) in discrete Bayesian networks always yields a clearly structured conditional probability table (CPT) rather than a potential as universally stated. A Bayesian network consists of a directed acyclic graph and a corresponding set of CPTs. Based on the conditional independencies holding in the directed acyclic graph, the product of the CP...
متن کاملA new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملGraphical Causal Models
This chapter discusses the use of directed acyclic graphs (DAGs) for causal inference in the observational social sciences. It focuses on DAGs’ main uses, discusses central principles, and gives applied examples. DAGs are visual representations of qualitative causal assumptions: They encode researchers’ beliefs about how the world works. Straightforward rules map these causal assumptions onto t...
متن کامل